Fast Search

Results: 263



#Item
41Parallel Repetition for Entangled k-player Games via Fast Quantum Search Kai-Min Chung1 , Xiaodi Wu2 , and Henry Yuen3 1 2

Parallel Repetition for Entangled k-player Games via Fast Quantum Search Kai-Min Chung1 , Xiaodi Wu2 , and Henry Yuen3 1 2

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-05-27 10:18:38
    42IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, MANUSCRIPT ID XXX 1 Localized Co-occurrence Model for Fast Approximate Search in 3D Structure Databases

    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, MANUSCRIPT ID XXX 1 Localized Co-occurrence Model for Fast Approximate Search in 3D Structure Databases

    Add to Reading List

    Source URL: staff.itee.uq.edu.au

    Language: English - Date: 2008-11-28 04:18:03
      43Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto

      Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto

      Add to Reading List

      Source URL: www.cs.toronto.edu

      Language: English - Date: 2012-06-28 15:40:37
      44WHAT IS SEO SEO IS: NOT about buying keywords NOT calling up Google and telling them where we want to be ranked NOT often a very fast process NOT shady (though there are plenty of bad apples out there!)

      WHAT IS SEO SEO IS: NOT about buying keywords NOT calling up Google and telling them where we want to be ranked NOT often a very fast process NOT shady (though there are plenty of bad apples out there!)

      Add to Reading List

      Source URL: www.chicagocraftmafia.com

      Language: English - Date: 2014-05-05 11:29:36
      45Optimal Dense Trajectories for Action Recognition with Fast Search Trees Konstantinos Avgerinakis , Alexia Briassouli , Yiannis Kompatsiaris 1,2 1

      Optimal Dense Trajectories for Action Recognition with Fast Search Trees Konstantinos Avgerinakis , Alexia Briassouli , Yiannis Kompatsiaris 1,2 1

      Add to Reading List

      Source URL: www.demcare.eu

      - Date: 2014-02-13 07:43:51
        46Knowl Inf Syst:375–391 DOIs10115SHORT PAPER PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining

        Knowl Inf Syst:375–391 DOIs10115SHORT PAPER PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining

        Add to Reading List

        Source URL: www.cs.sfu.ca

        - Date: 2009-09-03 11:45:19
          47E-COMMERCE SEARCH ENGINE MARKETING CASE STUDY Conversion rate optimisation and SEO for fast growing online store The client Our brief

          E-COMMERCE SEARCH ENGINE MARKETING CASE STUDY Conversion rate optimisation and SEO for fast growing online store The client Our brief

          Add to Reading List

          Source URL: www.cicada-online.com

          Language: English - Date: 2013-11-19 06:06:42
            48Search for An Annual Modulation in Three Years of CoGeNT Dark Matter Detector Data C.E. Aalseth,1 P.S. Barbeau,2, 3 J. Colaresi,4 J.I. Collar,5, ∗ J. Diaz Leon,6 J.E. Fast,1 N.E. Fields,5 T.W. Hossbach,1 A. Knecht,6 M.

            Search for An Annual Modulation in Three Years of CoGeNT Dark Matter Detector Data C.E. Aalseth,1 P.S. Barbeau,2, 3 J. Colaresi,4 J.I. Collar,5, ∗ J. Diaz Leon,6 J.E. Fast,1 N.E. Fields,5 T.W. Hossbach,1 A. Knecht,6 M.

            Add to Reading List

            Source URL: arxiv.org

            Language: English - Date: 2014-01-14 20:22:28
              49A Unified Approach to Learning Task-Specific Bit Vector Representations for Fast Nearest Neighbor Search Vinod Nair Dhruv Mahajan

              A Unified Approach to Learning Task-Specific Bit Vector Representations for Fast Nearest Neighbor Search Vinod Nair Dhruv Mahajan

              Add to Reading List

              Source URL: www.cs.toronto.edu

              Language: English - Date: 2012-02-24 13:23:21